A Local Sparse Screening Identification Algorithm with Applications
نویسندگان
چکیده
منابع مشابه
An Adaptive Greedy Algorithm with Application to Sparse Narma Identification
Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper a powerful greedy scheme developed in [1, 2] is converted into an adaptive algorithm which is applied to estimation of nonlinear channels. Performance is assessed via computer ...
متن کاملA Local Algorithm for the Sparse Spanning Graph Problem
Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, where the goal is to decide whether an edge is part of the spanning subgraph by examining only a small part of the input; yet, answers must be globally consistent and independent of prior queries. Unfortunately, maximally sparse spanning subgra...
متن کاملA Particle Swarm Optimization Algorithm with Local Sparse Representation for Visual Tracking
Handling appearance variations caused by the occlusion or abrupt motion is a challenging task for visual tracking. In this paper, we propose a novel tracking method that deals with the appearance changes based on sparse representation in a particle swarm optimization (PSO) framework. First, we divide each candidate state into multiple structural patches to cope with the partial occlusions of th...
متن کاملRobust ear identification using sparse representation of local texture descriptors
Abstract: Automated personal identification using localized ear images has wide range of civilian and law-enforcement applications. This paper investigates a new approach for more accurate ear recognition and verification problem using the sparse representation of local graylevel orientations. We exploit the computational simplicity of localized Radon transform for the robust ear shape represen...
متن کاملIterated SLSJF: A Sparse Local Submap Joining Algorithm with Improved Consistency
This paper presents a new local submap joining algorithm for building large-scale feature based maps. The algorithm is based on the recently developed Sparse Local Submap Joining Filter (SLSJF) and uses multiple iterations to improve the estimate and hence is called Iterated SLSJF (I-SLSJF). The input to the I-SLSJF algorithm is a sequence of local submaps. The output of the algorithm is a glob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Modeling in Engineering & Sciences
سال: 2020
ISSN: 1526-1506
DOI: 10.32604/cmes.2020.010061